Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs
نویسندگان
چکیده
We de ne a space of random edge-coloured graphs Gn;m; which correspond naturally to edge -colourings of Gn;m. We show that there exist constants K0; K1 21 such that provided m K0n logn and K1n then a random edge coloured graph contains a multi-coloured Hamilton cycle with probability tending to 1, as the number of vertices n tends to in nity.
منابع مشابه
A ug 2 00 5 RAINBOW HAMILTON CYCLES IN RANDOM REGULAR GRAPHS
A rainbow subgraph of an edge-coloured graph has all edges of distinct colours. A random d-regular graph with d even, and having edges coloured randomly with d/2 of each of n colours, has a rainbow Hamilton cycle with probability tending to 1 as n → ∞, provided d ≥ 8.
متن کاملA ug 2 00 5 RAINBOW HAMILTON CYCLES IN RANDOM REGULAR GRAPHS SVANTE JANSON
A rainbow subgraph of an edge-coloured graph has all edges of distinct colours. A random d-regular graph with d even, and having edges coloured randomly with d/2 of each of n colours, has a rainbow Hamilton cycle with probability tending to 1 as n → ∞, provided d ≥ 8.
متن کاملRainbow Hamilton cycles in random regular graphs
A rainbow subgraph of an edge-coloured graph has all edges of distinct colours. A random d-regular graph with d even, and having edges coloured randomly with d/2 of each of n colours, has a rainbow Hamilton cycle with probability tending to 1 as n→∞, for fixed d ≥ 8.
متن کاملGadget Graphs for Edge-coloured Graphs
In this paper, we consider properly edge-coloured (PC) paths and cycles in edge-coloured graphs. We consider a family of transformations of an edge-coloured graph G into an ordinary graph that allow us to check the existence PC cycles and PC (s, t)-paths in G and, if they exist, to find shortest ones among them. We raise a problem of finding the optimal transformation and consider a possible so...
متن کاملAlternating cycles and paths in edge-coloured multigraphs: A survey
A path or cycle in an edge-coloured multigraph is called alternating if its successive edges differ in colour. We survey results of both theoretical and algorithmic character concerning alternating cycles and paths in edge-coloured multigraphs. We also show useful connections between the theory of paths and cycles in bipartite digraphs and the theory of alternating paths and cycles in edge-colo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 11 شماره
صفحات -
تاریخ انتشار 2002